Linear polynomial approximation schemes in Banach holomorphic function spaces

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Holomorphic functions on Banach spaces

This is a survey about some problems from the theory of holomorphic functions on Banach spaces which have attracted the attention of many researchers during the last thirty years.

متن کامل

Kergin approximation in Banach spaces

We explore the convergence of Kergin interpolation polynomials of holomorphic functions in Banach spaces, which need not be of bounded type. We also investigate a case where the Kergin series diverges. Kergin interpolation is a generalization of both Lagrange interpolation in the one dimensional case, and the Taylor polynomial in the case where all interpolation points coincide. In several vari...

متن کامل

Diophantine Approximation in Banach Spaces

In this paper, we extend the theory of simultaneous Diophantine approximation to infinite dimensions. Moreover, we discuss Dirichlet-type theorems in a very general framework and define what it means for such a theorem to be optimal. We show that optimality is implied by but does not imply the existence of badly approximable points.

متن کامل

Polynomial-Time Approximation Schemes

We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-connectivity survivable-network design, and subset TSP. The schemes run in O(n log n) time for graphs embedded on both orientable and nonorientable surfaces. This work generalizes the PTAS frameworks of Borradaile, Klein, ...

متن کامل

Polynomial-Time Approximation Schemes

Let Π be an NP-hard optimization problem, and let A be an approximation algorithm for Π. For an instance I of Π, let A(I) denote the objective value when running A on I, and let OPT (I) denote the optimal objective value. The approximation ratio of A for the instance I is RA(I) = A(I)/OPT (I), thus, when Π is minimization (maximization) problem RA(I) ≥ 1 (RA(I) ≤ 1). A polynomial time approxima...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Analysis and Mathematical Physics

سال: 2019

ISSN: 1664-2368,1664-235X

DOI: 10.1007/s13324-019-00312-y